//
// Created by 紫霄 on 2020/5/17.
//

#ifndef LEETCODE_36_H
#define LEETCODE_36_H
class Node {
public:
  int val;
  Node *left;
  Node *right;

  Node() {}

  Node(int _val) {
    val = _val;
    left = nullptr;
    right = nullptr;
  }

  Node(int _val, Node *_left, Node *_right) {
    val = _val;
    left = _left;
    right = _right;
  }
};
class Solution {
public:
  Node *treeToDoublyList(Node *root) {}
};
#endif // LEETCODE_36_H
